Properties of four partial orders on standard Young tableaux

نویسنده

  • Müge Taskin
چکیده

Let SY Tn be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SY Tn and some of their crucial properties, we prove three main results: • Intervals in any of these four orders essentially describe the product in a Hopf algebra of tableaux defined by Poirier and Reutenauer. • The map sending a tableau to its descent set induces a homotopy equivalence of the proper parts of all of these orders on tableaux with that of the Boolean algebra 2[n−1]. In particular, the Möbius function of these orders on tableaux is (−1)n−3. • For two of the four orders, one can define a more general order on skew tableaux having fixed inner boundary, and similarly analyze their homotopy type and Möbius function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Combinatorics of Orbital Varieties Closures of Nilpotent Order 2 in sln

We consider two partial orders on the set of standard Young tableaux. The first one is induced to this set from the weak right order on symmetric group by Robinson-Schensted algorithm. The second one is induced to it from the dominance order on Young diagrams by considering a Young tableau as a chain of Young diagrams. We prove that these two orders of completely different nature coincide on th...

متن کامل

Ììì Óñòòøóöö Blockin× Óó Óöööøøð Úöööøøø× Ðó×ùöö× Óó Òòðôóøøòø Óöööö ¾ Ò ×ð N

We consider two partial orders on the set of standard Young tableaux. The first one is induced to this set from the weak right order on symmetric group by Robinson-Schensted algorithm. The second one is induced to it from the dominance order on Young diagrams by considering a Young tableau as a chain of Young diagrams. We prove that these two orders of completely different nature coincide on th...

متن کامل

Pattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux

We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...

متن کامل

ON ORBITAL VARIETY CLOSURES IN sln III.GEOMETRIC PROPERTIES

This is the third paper in the series. Here we define a few combinatorial orders on Young tableaux. The first order is obtained from induced Duflo order by the extension with the help of Vogan Tα,β procedure. We call it Duflo-Vogan order. The second order is obtained from the generalization of Spaltenstein’s construction by consideration of an orbital variety as a double chain of nilpotent orbi...

متن کامل

On two related questions of Wilf concerning Standard Young Tableaux

We consider two questions ofWilf related to Standard Young Tableaux. We provide a partial answer to one question, and that will lead us to a more general answer to the other question. Our answers are purely combinatorial.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 113  شماره 

صفحات  -

تاریخ انتشار 2006